On generalized Howell designs with block size three
نویسندگان
چکیده
منابع مشابه
On generalized Howell designs with block size three
In this paper, we examine a class of doubly resolvable combinatorial objects. Let t, k, λ, s and v be nonnegative integers, and let X be a set of v symbols. A generalized Howell design, denoted t-GHDk(s, v;λ), is an s × s array, each cell of which is either empty or contains a k-set of symbols from X, called a block, such that: (i) each symbol appears exactly once in each row and in each column...
متن کاملGeneralized Bhaskar Rao designs with block size three
We show that the necessary conditions λ = 0 (mod IGI), λ(v-l)=0 (mod2), λv(v 1) = [0 (mod 6) for IGI odd, (0 (mod 24) for IGI even, are sufficient for the existence of a generalized Bhaskar Rao design GBRD(v,b,r,3,λ;G) for the elementary abelian group G, of each order IGI. Disciplines Physical Sciences and Mathematics Publication Details Seberry, J, Generalized Bhaskar Rao designs with block si...
متن کاملHowell Designs with Sub-designs
A Howell design of side s and order 2n, or more briefly an H(s, 2n), is an s x s array in which each cell is either empty or contains an unordered pair of elements from some (2n)-set V such that (1) every element of V occurs in precisely one cell of each row and each column, and (2) every unordered pair of elements from V is in at most one cell of the array. It follows immediately from the defi...
متن کاملOn Defining Sets of Full Designs with Block Size Three
A defining set of a t-(v, k, λ) design is a subcollection of its blocks which is contained in no other t-design with the given parameters, on the same point set. A minimal defining set is a defining set, none of whose proper subcollections is a defining set. The spectrum of minimal defining sets of a design D is the set {|M | | M is a minimal defining set of D}. We show that if a t-(v, k, λ) de...
متن کاملGeneralized Balanced Tournament Designs with Block Size Four
In this paper, we remove the outstanding values m for which the existence of a GBTD(4,m) has not been decided previously. This leads to a complete solution to the existence problem regarding GBTD(4,m)s.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Designs, Codes and Cryptography
سال: 2015
ISSN: 0925-1022,1573-7586
DOI: 10.1007/s10623-015-0162-7